Simple real-time constant-space string matching
نویسندگان
چکیده
منابع مشابه
Simple Real-Time Constant-Space String Matching
We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.
متن کاملReal-Time String Matching in Sublinear Space
We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant " > 0, a real-time string matching algorithm claiming O(m") extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use (m) extra
متن کاملConstant-Space String-Matching in Sublinear Average Time
Given two strings: pattern P of lengthm and text T of length n. The stringmatching problem is to nd all occurrences of the pattern P in the text T . We present a simple string-matching algorithms which works in average o(n) time with constant additional space for one-dimensional texts and two-dimensional arrays. This is the rst attempt to the small-space string-matching problem in which subline...
متن کاملConstant-Time Randomized Parallel String Matching
Given a pattern string of length m for the string matching problem, we design an algorithm that computes deterministic samples of a suuciently long substring of the pattern in constant time. This problem used to be the bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The best previous time bound was O(log 2 m= log log m). We use this algorithm to obtain the ...
متن کامل- - - - Constant - time pattern matching for real - time production systems Dale
__________ Many intelligent systems must respond to sensory data or critical environmental conditions in fixed, predictable time. Rule-based systems, including those based on the efficient Rete matching algorithm, cannot guarantee this result. Improvement in execution-time efficiency is not all that is needed here; it is important to ensure constant, O(1) time limits for portions of the matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.040